3D Surface Reconstruction from Unorganized Sparse Cross Sections
نویسندگان
چکیده
In this paper, we propose an algorithm for closed and smooth 3D surface reconstruction from unorganized planar cross sections. We address the problem in its full generality, and show its effectiveness on sparse set of cutting planes. Our algorithm is based on the construction of a globally consistent signed distance function over the cutting planes. It uses a split-and-merge approach utilising Hermite mean-value interpolation for triangular meshes. This work improvises on recent approaches by providing a simplified construction that avoids need for post-processing to smooth the reconstructed object boundary. We provide results of reconstruction and its comparison with other algorithms.
منابع مشابه
3D Reconstruction from Sparse Unorganized Cross Sections
In this thesis work, we propose an algorithm for smooth 3D object reconstruction from unorganized planar cross sections. We address the problem in its full generality, and show its effectiveness on sparse set of cutting planes. Our algorithm is based on construction of a globally consistent signed distance function over the cutting planes. It uses a divide-and-conquer approach utilizing Hermite...
متن کاملProvably Good 2D Shape Reconstruction from Unorganized Cross-Sections
This paper deals with the reconstruction of 2-dimensional geometric shapes from unorganized 1-dimensional cross-sections. We study the problem in its full generality following the approach of Boissonnat and Memari [BM07] for the analogous 3D problem. We propose a new variant of this method and provide sampling conditions to guarantee that the output of the algorithm has the same topology as the...
متن کاملSigning the Unsigned: Robust Surface Reconstruction from Raw Pointsets
We propose a modular framework for robust 3D reconstruction from unorganized, unoriented, noisy, and outlierridden geometric data. We gain robustness and scalability over previous methods through an unsigned distance approximation to the input data followed by a global stochastic signing of the function. An isosurface reconstruction is finally deduced via a sparse linear solve. We show with exp...
متن کاملSECTION II Surface Reconstruction from Unorganized Data Sets Through Point Based Edge Segmentation
The general problem of 3D shape reconstruction from unorganized data sets can be described as follows: Given 3D range data or dense 3D scattered point sets sampled on or near an unknown object surface, reconstruct the topological and geometrical structures represented by the data points. The data points should be approximated by a set of smooth, connected surface patches such that the accuracy ...
متن کاملOrienting unorganized points for surface reconstruction
We address the problem of assigning consistently oriented normal vectors to unorganized point cloud with noises, non-uniformities, and thinsharp features as a pre-processing step to surface reconstruction. The conventional orienting scheme using minimal spanning tree fails on points with the above defects. Different from the recently developed consolidation technique, our approach does not modi...
متن کامل